Low-Overhead Time-Triggered Group Membership
نویسندگان
چکیده
A group membership protocol is presented and proven correct for a synchronous time-triggered model of computation with processors in a ring that broadcast in turn. The protocol, derived from one used for critical control functions in automobiles, accepts a very restrictive fault model to achieve low overhead and requires only one bit of membership information piggybacked on regular broadcasts. Given its strong fault model, the protocol guarantees that a faulty processor will be promptly diagnosed and removed from the agreed group of processors, and will also diagnose itself as faulty. The protocol is correct under a fault-arrival assumption that new faults arrive at least n+1 time units apart, when there are n processors. Exploiting this assumption leads to unusual real-time reasoning in the correctness proof.
منابع مشابه
TTP - A Protocol for Fault-Tolerant Real-Time Systems
The Time-Triggered Protocol integrates such services as predictable message transmission, clock synchronization, membership, mode change, and blackout handling. It also supports replicated nodes and replicated communication channels. eal-time control systems must share critical information among autonomous subsystems in a timely and reliable manner. For example, automotive applications have sep...
متن کاملIntegration of Group Membership with Clock Synchronization in Time-Triggered Architecture (TTA)
متن کامل
Reducing Monitoring Overhead by Integrating Event- and Time-Triggered Techniques
Runtime verification is a formal technique used to check whether a program under inspection satisfies its specification by using a runtime monitor. Existing monitoring approaches use one of two ways for evaluating a set of logical properties: (1) event-triggered, where the program invokes the monitor when the state of the program changes, and (2) time-triggered, where the monitor periodically p...
متن کاملA Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
We describe a novel scalable group membership service designed explicitly for wide area networks. Our membership service is scalable in the number of groups supported, in the number of members in each group, and in the topology each group spans. Our service also supplies the hooks needed to provide clients with full virtual synchrony semantics. Our service attains, on average, a low message ove...
متن کاملSecure and Efficient Tree-based Group Diffie-Hellman Protocol
Current group key agreement protocols (often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low perform...
متن کامل